On degree sequence optimization
نویسندگان
چکیده
منابع مشابه
On the reconstruction of the degree sequence
Harary’s edge reconstruction conjecture states that a graph G=(V; E) with at least four edges is uniquely determined by the multiset of its edge-deleted subgraphs, i.e. the graphs of the form G − e for e∈E. It is well-known that this multiset uniquely determines the degree sequence of a graph with at least four edges. In this note we generalize this result by showing that the degree sequence of...
متن کاملRao's degree sequence conjecture
Let us say two (simple) graphs G,G′ are degree-equivalent if they have the same vertex set, and for every vertex, its degrees in G and in G′ are equal. In the early 1980’s, S. B. Rao made the conjecture that in any infinite set of graphs, there exist two of them, say G and H, such that H is isomorphic to an induced subgraph of some graph that is degree-equivalent to G. We prove this conjecture.
متن کاملDegree sequence index strategy
We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by which to bound graph invariants by certain indices in the ordered degree sequence. As an illustration of the DSI strategy, we show how it can be used to give new upper and lower bounds on the k-independence and the k-domination numbers. These include, among other things, a double generalization of the annihilation num...
متن کاملOptimization over Degree Sequences
We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that deciding if a given sequence is the degree sequence of a 3-hypergraph is computationally prohibitive, thereby solving a 30 year long open problem. This implie...
متن کاملDegree sequence and supereulerian graphs
A sequence d = (d1, d2, · · · , dn) is graphic if there is a simple graph G with degree sequence d, and such a graph G is called a realization of d. A graphic sequence d is linehamiltonian if d has a realizationG such that L(G) is hamiltonian, and is supereulerian if d has a realization G with a spanning eulerian subgraph. In this paper, it is proved that a nonincreasing graphic sequence d = (d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2020
ISSN: 0167-6377
DOI: 10.1016/j.orl.2020.10.010